Optimum Huffman Forests
نویسنده
چکیده
In this paper we solve the following problem: Given a positive integer f and L weights (real numbers), nd a partition with f classes of the multiset of weights such that the sum of the costs of the optimum m-ary Hu man trees built for every class of is minimum. An application to the optimal extendibility problem for pre x codes is proposed.
منابع مشابه
Optimum Probability Distribution for Minimum
In the present communication, we have obtained the optimum probability distribution with which the messages should be delivered so that the average redundancy of the source is minimized. Here, we have taken the case of various generalized mean codeword lengths. Moreover, the upper bound to these codeword lengths has been found for the case of Huffman encoding.
متن کاملAnalysis of Don’t Care Bit Filling Techniques for Optimization of Compression and Scan Power
Test power and test time have been the major issues for current scenario of VLSI testing. The test data compression is the well known method used to reduce the test time. The don’t care bit filling method can be used for effective test data compression as well as reduction in scan power. In this paper we describe the algorithm for don’t care assignment like MT(Minimum Transition)-fill technique...
متن کاملMorphological skeleton representation and coding of binary images
This paper presents the results of a study on the use of morphological set operations to represent and encode a discrete binary image by parts of its skeleton, a thinned version of the image containing complete information about its shape and size. Using morphological erosions and openings, a finite image can be uniquely decomposed into a finite number of skeleton subsets and then the image can...
متن کاملImage Compression Based on Wavelet and Quantization with Optimal Huffman Code
This paper proposes a method for the compression of color images by Haar transform, quantization and construction of minimum redundancy code using conventional Huffman coding. Wavelet compression is accomplished by decomposing the row and column of the image matrix using the Harr transform. And the reconstruction of the image is feasible just from 1/4 of the decomposed image and even 1/16 of th...
متن کاملUniform and Non-Uniform Optimum Scalar Quantisers: A Comparative Study
The aim of this research is to investigate source coding, the representation of information source output by finite R bits/symbol. The performance of optimum quantisers subject to an entropy constraint has been studied. The definitive work in this area is best summarised by Shannon’s source coding theorem, that is, a source with entropy H can be encoded with arbitrarily small error probability ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. UCS
دوره 3 شماره
صفحات -
تاریخ انتشار 1997